Building Proofs by Analogy via the Curry-Horward Isomorphism
نویسندگان
چکیده
We present a formal method for building proofs by analogy and its implementation as a proof tactic for the NuPRL proof development system. The Curry-Howard Isomorphism is used to represent proof constructions in a term-functional language and to specify analogies by transformation rules on these terms. The method has the advantage to admit complete formalization and to make use of well-known techniques like higher-order uniication.
منابع مشابه
Contextual Natural Deduction
This paper defines the contextual natural deduction calculus ND for the implicational fragment of intuitionistic logic. ND extends the usual natural deduction calculus (here called ND) by allowing the implication introduction and elimination rules to operate on formulas that occur inside contexts. In analogy to the Curry-Howard isomorphism between ND and the simply-typed λ-calculus, an extensio...
متن کاملChapter 3 Proofs as Programs
In this chapter we investigate a computational interpretation of constructive proofs and relate it to functional programming. On the propositional fragment of logic this is referred to as the Curry-Howard isomorphism [How80]. From the very outset of the development of constructive logic and mathematics, a central idea has been that proofs ought to represent constructions. The Curry-Howard isomo...
متن کاملTowards Animation of Proofs {testing proofs by examples{
In this paper, we introduce the notion of proof animation. It is a new application of the principle of \Curry-Howard isomorphism" to formal proof developments. Logically, proof animation is merely a contrapositive of \proofs as programs," which is an application of Curry-Howard isomorphism to formal program developments. Nonetheless, the new viewpoint totally changes the scene. The motivation, ...
متن کاملA Logic of Interactive Proofs (Formal Theory of Knowledge Transfer)
We propose a logic of interactive proofs as a framework for an intuitionistic foundation for interactive computation, which we construct via an interactive analog of the Gödel-McKinsey-Tarski-Artëmov definition of Intuitionistic Logic as embedded into a classical modal logic of proofs, and of the Curry-Howard isomorphism between intuitionistic proofs and typed programs. Our interactive proofs e...
متن کاملAn Isomorphism Between Substructural Proofs and Deterministic Finite Automata∗
Proof theory is a powerful tool for understanding computational phenomena, as most famously exemplified by the Curry–Howard isomorphism between intuitionistic logic and the simply-typed λ-calculus. In this paper, we identify a fragment of intuitionistic linear logic with least fixed points and establish a Curry–Howard isomorphism between a class of proofs in this fragment and deterministic fini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992